Drawing lines by uniform packing
نویسندگان
چکیده
In this paper, we introduce a new approach to line drawing that attempts to maintain a uniform packing density of horizontal segments to diagonal segments throughout the line. While the conventional line drawing algorithms perform linear time computations to find the location of the pixels, our algorithm takes logarithmic time. Also, experimental results show that the quality of line is acceptable and comparable to the well-known Bresenham’s line-drawing algorithm. r 2006 Elsevier Ltd. All rights reserved.
منابع مشابه
Drawing Graphs in the Hyperbolic Plane
It is shown how one can draw graphs on surfaces of negative Euler characteristic by using hyperbolic geometry and hyperbolic circle packing representations. The same approach applies to drawings of hyperbolic tessellations.
متن کاملLog-Normal and Mono-Sized Particles’ Packing into a Bounded Region
Many systems can be modeled with hard and various size spheres, therefore packing and geometrical structures of such sets are of great importance. In this paper, rigid spherical particles distributed in different sizes are randomly packed in confined spaces, using a parallel algorithm. Mersenne Twister algorithm was used to generate pseudorandom numbers for initial coordination of particles. Di...
متن کاملPlanar Lombardi Drawings for Subcubic Graphs
We prove that every planar graph with maximum degree three has a planar drawing in which the edges are drawn as circular arcs that meet at equal angles around every vertex. Our construction is based on the Koebe–Thurston–Andreev circle packing theorem, and uses a novel type of Voronoi diagram for circle packings that is invariant under Möbius transformations, defined using three-dimensional hyp...
متن کاملThe Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings
Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings ubiquitously use iterative numerical approximations rather than constructing and then solving algebraic expressions representing their exact solutions. To explain th...
متن کاملA THEORETICALLY CORRECT RESOURCE USAGE VISUALIZATION FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM
The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Graphics
دوره 30 شماره
صفحات -
تاریخ انتشار 2006